High-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier

نویسندگان

  • ZHANG Rui
  • He Debiao
  • CHEN Jianhua
  • HU Jin
چکیده

A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication. Using a radix 2, an n-bit modular multiplication only takes about n/w+6 cycles. This leads to a competitive ASIC implementation for RSA and Elliptic Curve Cryptography (ECC).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A High-Speed Design of Montgomery Multiplier

With the increase of key length used in public cryptographic algorithms such as RSA and ECC, the speed of Montgomery multiplication becomes a bottleneck. This paper proposes a high speed design of Montgomery multiplier. Firstly, a modified scalable high-radix Montgomery algorithm is proposed to reduce critical path. Secondly, a highradix clock-saving dataflow is proposed to support high-radix o...

متن کامل

Radix – 4 Implementation of a Montgomery Multiplier for a RSA Cryptosystem

As cryptosystems become more important to computing, so does the need to make the encryption and decryption of larger and stronger keys faster. The RSA algorithm presents one of these problems specifically in performing modular exponentiation. A popular method to implement the necessary modular multiplication and squaring required for exponentiation is the Montgomery Multiplication (MM) algorit...

متن کامل

High-Radix Design of a Scalable Modular Multiplier

This paper describes an algorithm and architecture based on an extension of a scalable radix-2 architecture proposed in a previous work. The algorithm is proven to be correct and the hardware design is discussed in detail. Experimental results are shown to compare a radix-8 implementation with a radix-2 design. The scalable Montgomery multiplier is adjustable to constrained areas yet being able...

متن کامل

Speed and Area Optimized Parallel Higher-Radix Modular Multipliers

Modular multiplication is the fundamental and compute-intense operation in many Public-Key crypto-systems. This paper presents two modular multipliers with their efficient architectures based on Booth encoding, higher-radix, and Montgomery powering ladder approaches. Montgomery powering ladder technique enables concurrent execution of main operations in the proposed designs, while higher-radix ...

متن کامل

Efficient VLSI Architecture for Montgomery Modular Multiplier

Montgomery modular multiplication is used in cryptographic algorithms and digital signal processing application. The main objective is to reduce the delay and area of the Montgomery multipliers while maintaining low hardware complexity. To speed up, high-speed Montgomery modular multiplication algorithms and hardware architectures employ carry-save addition to avoid the carry propagation at eac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011